On Finding the Smallest Generalized Eigenpair Using Markov Chain Monte Carlo Algorithm
نویسنده
چکیده
This paper proposes a new technique based on inverse Markov chain Monte Carlo algorithm for finding the smallest generalized eigenpair of the large scale matrices. Some numerical examples show that the proposed method is efficient.
منابع مشابه
Spatial count models on the number of unhealthy days in Tehran
Spatial count data is usually found in most sciences such as environmental science, meteorology, geology and medicine. Spatial generalized linear models based on poisson (poisson-lognormal spatial model) and binomial (binomial-logitnormal spatial model) distributions are often used to analyze discrete count data in which spatial correlation is observed. The likelihood function of these models i...
متن کاملA Monte Carlo Approach for Finding More than One Eigenpair
The Monte Carlo method has been successfully used for computing the extreme (largest and smallest in magnitude) eigenvalues of matrices. In this paper we study computing eigenvectors as well with the Monte Carlo approach. We propose and study a Monte Carlo method based on applying the ergodic theorem and compare the results with those produced by a Monte Carlo version of the power method. We al...
متن کاملA Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind
In the present work, a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind. The solution of the integral equation is described by the Neumann series expansion. Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method. An algorithm is proposed to sim...
متن کاملOn automating Markov chain Monte Carlo for a class of spatial models
Markov chain Monte Carlo (MCMC) algorithms provide a very general recipe for estimating properties of complicated distributions. While their use has become commonplace and there is a large literature on MCMC theory and practice, MCMC users still have to contend with several challenges with each implementation of the algorithm. These challenges include determining how to construct an efficient a...
متن کاملBayesian analysis of continuous time Markov chains with application to phylogenetic modelling
Bayesian analysis of continuous time, discrete state space time series is an important and challenging problem, where incomplete observation and large parameter sets call for user-defined priors based on known properties of the process. Generalized linear models have a largely unexplored potential to construct such prior distributions. We show that an important challenge with Bayesian generaliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013